#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/random.hpp>
#include <boost/random/linear_congruential.hpp>
using namespace boost;

#include <iostream>

#include <ctime>

int main()
{
  typedef adjacency_list<setS,vecS,undirectedS> graph_t;
  
  //unsigned int N =100000;
  //unsigned int M =10000000;

  unsigned int N =100000;
  unsigned int M =100000000;

  graph_t g;

  boost::minstd_rand gen;

  clock_t start, finish;

  start =clock();
  generate_random_graph( g, N, M, gen, false, false);
  finish =clock();

  std::cout <<(double)(finish - start)/(double)CLOCKS_PER_SEC 
	    <<" [sec]" 
	    <<std::endl;

  return 0;
}
